Abstract: Dynamic collaborative spectrum allocation optimization of cognitive radio network is studied in this paper. A spectrum allocation model based on graph coloring theory is proposed. For an immutable topology, weighted distributed greedy algorithm, fairness based distributed greedy algorithm and improved randomized distributed algorithm are proposed for optimizing throughput, fairness and collaborative overhead respectively. For a mutable topology, a fast channel adjustment algorithm is proposed. Experimental results show that the algorithm reduces communication costs remarkably while providing good performance in throughput and fairness.

Key words: cognitive radio network, collaborative spectrum allocation, graph coloring theory, local optimizing, distributed algorithm